minimal graph
英 [ˈmɪnɪməl ɡræf]
美 [ˈmɪnɪməl ɡræf]
网络 极小图
双语例句
- For the subclasses MAX and MARG of minimal unsatisfiable formulas, we show that the variable and literal renaming problems are equivalent to the graph isomorphism problem GI.
对于极小不可满足公式的子类MAX和MARG，我们证明了：其变元改名和文字改名的复杂性等价于图同构问题GI。 - Maximal Packing and Minimal Covering of the Complete Bipartite Graph K_ ( m, n) with C_8;
用8长圈C8最大填充和最小覆盖完全二部图K（m，n） - A Minimal Spanning Tree based Graph Indexing Algorithm
基于最小生成树的图数据库索引算法 - In chapter two, the minimal energy graph for fully angular hexagonal chains is helical hexagonal chain.
在第二章中，得到了全角六角链的极小能量图是螺旋链。 - G is a minimal connected graph.
G是一个极小连通图。 - The two algorithms for finding the minimal spanning tree of an undirected weighted graph are PRIM algorithm and KRUSKAL algorithm.
对求无向赋权图最小生成树两种算法分别是PRIM算法和KRUSKAL算法。 - With the assumption of omni-directional antenna, broadcast in MANETs can be reduced as the minimal connected dominating set ( MCDS) problem in graph theory.
当节点采用全向天线时，该问题可以归结为图论中的最小连通支配集（MCDS）问题。 - The new neural network algorithm for searching graph minimal cut set, called NNMC algorithm, is established on the basis of construction of Hopfield Network energy function according to the concrete problem.
针对问题的特点，建立了Hopfield网络的能量函数，提出并构造了一种寻找任意图最小割集的神经网络算法&NNMC（NeuralNetworkMinimalCut）算法。 - Efficient Algorithms for Enumerating all Minimal Separators in a Graph
图的极小顶剖的有效枚举算法 - With the support of GIS, the minimal spanning tree theory of graph theory and 120 project theory can be applied to irrigation pipeline's layout optimization.
首次提出了将GIS（地理信息系统）和图论技术应用于低压管道输水灌溉规划设计及灌溉管网优化中，在GIS支持环境下，应用图论中的最小生成树法和120°规划进行管道的最优化布置。 - Minimal diameter orientation for complete split graph
Split完全图的最小直径定向 - Beginning with the minimal complete cells graph in dynamic manufacturing alliance, the linear was distinguished from nonlinear relation among cells.
以动态制造联盟的最小完备单元图为出发点，区分单元之间的线性作用和非线性作用。 - A DNA Solution on Surface for Minimal Vertex Covering Problems of Graph
图的最小顶点覆盖问题的面上DNA解法 - Generalization of wave angles in Steiner minimal trees on trapezoid wave graph
梯形波图Steiner最小树波角的推广 - A Simple Algorithm for Enumerating All the Minimal Cuts of An Undirected Graph
枚举一个无向图所有最小割集的一种简单算法 - The concept of the short Hamilton cycle is introduced. The minimal weight method to solve λ level short Hamilton cycle of weight graph G ( n, m) is obtained by analysis of the features of the shortest Hamilton resulted from extended.
提出短哈密顿回路的概念，分析由延长而形成最短哈密顿回路的特点，得出求权图G（n，m）λ阶短哈密顿回路的最小权法。 - In this paper, we research the relations between the maximal independent set and minimal covering set of a graph, and give a general logical and recursive algorithm of maximal independent set and minimal covering set.
本文主要研究了图的极大独立集与极小覆盖集之间的关系，并给出了将图的所有极大独立集与极小覆盖集一次性给出的逻辑及递归算法。 - We study the essential characters of the minimal f-broadcasting graph and the especial qualities in an special f, which is familiar in the competition self-combination network.
讨论了极小f广播图的基本性质并针对竞争自组网中一种常见的f模式讨论了其特殊性质。 - Discussions about the Two Algorithms for Finding the Minimal Spanning Tree of an Undirected Weighted Graph
求无向赋权图最小生成树的两种算法的探讨 - A New Algorithm for Generating all Minimal Cutsets in a Graph
求网络极小割集的一个新算法 - The Coloring and Edge Number of Minimal n-Edge Connected Graph
极小n棱连通图的着色与棱数 - The traveling salesman problems are availably solved by being transformed to solve the Hamilton circle of the minimal weight value in the evaluate graph, and using the massive parallelism of sticker system.
通过将旅行商问题转化为求赋权图中权值最小的Hamilton圈，利用粘贴系统模型的巨大并行性，可以有效的求解旅行商问题。 - A minimal cost fault diagnosis mathematics model based on a fuzzy weighted bipartite graph for the airborne missile circuit fault diagnose problem is put forward, and an effective algorithm for it is given.
针对机载导弹电路故障诊断问题，提出了在赋模糊权的二部图中求解故障诊断费用最小的诊断顺序的数学模型，并给出了该模型的优化算法。 - We newly define the minimal broadcasting graph in f mode, and prove the rationality of the definition.
针对f模式重新定义了极小广播图，并证明了定义的合理性； - Mind evolutionary computation is used in solving vertex coloring problem. A new algorithm of chromatic number and minimal coloring of a given graph is given.
应用思维进化计算求解顶点着色问题，给出求解给定图的色数、最小着色的算法。 - First, this method builts up a C-R graph based on the relationship among resource places, then the set of all strict minimal siphons is obtained from the C-R graph by the relevant formulas, theorems and algorithms.
该方法首先根据资源库所之间的结构关系构建C-R图，然后通过相关计算公式、定理及算法给出由C-R图得到严格极小信标集合的具体过程。 - By reducing the broadcasting problem into the minimal strong connected dominating set problem of interface-extended graph, we propose a Self-Pruning approach to reduce the redundancy.
通过将广播问题归结为接口扩展图中的最小强连通支配集问题，我们提供了一种自剪枝策略用于减少广播冗余。